^-divisibility and a Theorem of Lorentz and Shimogaki
نویسندگان
چکیده
The Brudnyi-Krugljak theorem on the if-divisibility of Gagliardo couples is derived by elementary means from earlier results of LorentzShimogaki on equimeasurable rearrangements of measurable functions. A slightly stronger form of Calderón's theorem describing the Hardy-LittlewoodPólya relation in terms of substochastic operators (which itself generalizes the classical Hardy-Littlewood-Pólya result for substochastic matrices) is obtained.
منابع مشابه
Lorentz-Shimogaki and Boyd theorems for weighted Lorentz spaces
We prove the Lorentz-Shimogaki and Boyd theorems for the spaces Λu(w). As a consequence, we give the complete characterization of the strong boundedness of H on these spaces in terms of some geometric conditions on the weights u and w, whenever p > 1. For these values of p, we also give the complete solution of the weak-type boundedness of the Hardy-Littlewood operator on Λu(w).
متن کاملA New Characterization of the Muckenhoupt Ap Weights Through an Extension of the Lorentz-Shimogaki Theorem
Given any quasi-Banach function space X over Rn it is defined an index αX that coincides with the upper Boyd index ᾱX when the space X is rearrangement-invariant. This new index is defined by means of the local maximal operator mλf . It is shown then that the Hardy-Littlewood maximal operator M is bounded on X if and only if αX < 1 providing an extension of the classical theorem of Lorentz and ...
متن کاملModeling of Infinite Divisible Distributions Using Invariant and Equivariant Functions
Basu’s theorem is one of the most elegant results of classical statistics. Succinctly put, the theorem says: if T is a complete sufficient statistic for a family of probability measures, and V is an ancillary statistic, then T and V are independent. A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics. In addition ...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملON MODALITY AND DIVISIBILITY OF POISSON AND BINOMIAL MIXTURES
Some structural aspects of mixtures, in general, have been previously investigated by the author in [I] and [2]. The aim of this article is to investigate some important structural properties of the special cases of Poisson and binomial mixtures in detail. Some necessary and sufficient conditions are arrived at for different modality and divisibility properties of a Poisson mixture based o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010